On a problem of Erd\H{o}s and Rothschild on edges in triangles

Erd\H{o}s and Rothschild asked to estimate the maximum number, denoted by H(N,C), such that every N-vertex graph with at least CN^2 edges, each of which is contained in at least one triangle, must contain an edge that is in at least H(N,C) triangles. In particular, Erd\H{o}s asked in 1987 to determine whether for every C>0 there is \epsilon >0 such that H(N,C) > N^\epsilon, for all sufficiently large N. We prove that H(N,C) = N^{O(1/log log N)} for every fixed C < 1/4. This gives a negative answer to the question of Erd\H{o}s, and is best possible in terms of the range for C, as it is known that every N-vertex graph with more than (N^2)/4 edges contains an edge that is in at least N/6 triangles.Comment: 8 page

Remarks on the derivation of Gross-Pitaevskii equation with magnetic Laplacian

The effective dynamics for a Bose-Einstein condensate in the regime of high dilution and subject to an external magnetic field is governed by a magnetic Gross-Pitaevskii equation. We elucidate the steps needed to adapt to the magnetic case the proof of the derivation of the Gross-Pitaevskii equation within the "projection counting" scheme

Maximum hitting for n sufficiently large

For a left-compressed intersecting family \A contained in [n]^(r) and a set X contained in [n], let \A(X) = {A in \A : A intersect X is non-empty}. Borg asked: for which X is |\A(X)| maximised by taking \A to be all r-sets containing the element 1? We determine exactly which X have this property, for n sufficiently large depending on r.Comment: Version 2 corrects the calculation of the sizes of the set families appearing in the proof of the main theorem. It also incorporates a number of other smaller corrections and improvements suggested by the anonymous referees. 7 page

Strong polarized relations for the continuum

We prove that the strong polarized relation for the continuum holds for $\aleph_0$ and for every supercompact cardinal. We use iteration of Mathias forcing.Comment: 9 page

Soft random solids and their heterogeneous elasticity

Spatial heterogeneity in the elastic properties of soft random solids is examined via vulcanization theory. The spatial heterogeneity in the \emph{structure} of soft random solids is a result of the fluctuations locked-in at their synthesis, which also brings heterogeneity in their \emph{elastic properties}. Vulcanization theory studies semi-microscopic models of random-solid-forming systems, and applies replica field theory to deal with their quenched disorder and thermal fluctuations. The elastic deformations of soft random solids are argued to be described by the Goldstone sector of fluctuations contained in vulcanization theory, associated with a subtle form of spontaneous symmetry breaking that is associated with the liquid-to-random-solid transition. The resulting free energy of this Goldstone sector can be reinterpreted as arising from a phenomenological description of an elastic medium with quenched disorder. Through this comparison, we arrive at the statistics of the quenched disorder of the elasticity of soft random solids, in terms of residual stress and Lam\'e-coefficient fields. In particular, there are large residual stresses in the equilibrium reference state, and the disorder correlators involving the residual stress are found to be long-ranged and governed by a universal parameter that also gives the mean shear modulus.Comment: 40 pages, 7 figure

The irrationality of a number theoretical series

Denote by $\sigma_k(n)$ the sum of the $k$-th powers of the divisors of $n$, and let $S_k=\sum_{n\geq 1}\frac{\sigma_k(n)}{n!}$. We prove that Schinzel's conjecture H implies that $S_k$ is irrational, and give an unconditional proof for the case $k=3$

Spectral Statistics of Erd{\H o}s-R\'enyi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues

We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ graphs on $N$ vertices where every edge is chosen independently and with probability $p \equiv p(N)$. We rescale the matrix so that its bulk eigenvalues are of order one. Under the assumption $p N \gg N^{2/3}$, we prove the universality of eigenvalue distributions both in the bulk and at the edge of the spectrum. More precisely, we prove (1) that the eigenvalue spacing of the Erd{\H o}s-R\'enyi graph in the bulk of the spectrum has the same distribution as that of the Gaussian orthogonal ensemble; and (2) that the second largest eigenvalue of the Erd{\H o}s-R\'enyi graph has the same distribution as the largest eigenvalue of the Gaussian orthogonal ensemble. As an application of our method, we prove the bulk universality of generalized Wigner matrices under the assumption that the matrix entries have at least $4 + \epsilon$ moments

Random graphs containing arbitrary distributions of subgraphs

Traditional random graph models of networks generate networks that are locally tree-like, meaning that all local neighborhoods take the form of trees. In this respect such models are highly unrealistic, most real networks having strongly non-tree-like neighborhoods that contain short loops, cliques, or other biconnected subgraphs. In this paper we propose and analyze a new class of random graph models that incorporates general subgraphs, allowing for non-tree-like neighborhoods while still remaining solvable for many fundamental network properties. Among other things we give solutions for the size of the giant component, the position of the phase transition at which the giant component appears, and percolation properties for both site and bond percolation on networks generated by the model.Comment: 12 pages, 6 figures, 1 tabl

Relaxation dynamics of maximally clustered networks

We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics---the double-edge swap, corresponding to degree-preserving randomization of the configuration model, and single edge replacement, corresponding to full randomization of the Erd\H{o}s--R\'enyi random graph. We derive expressions for the time evolution of the degree distribution, edge multiplicity distribution and clustering coefficient. We show that under both dynamics networks undergo a continuous phase transition in which a giant connected component is formed. We calculate the position of the phase transition analytically using the Erd\H{o}s--R\'enyi phenomenology

Growth of graph states in quantum networks

We propose a scheme to distribute graph states over quantum networks in the presence of noise in the channels and in the operations. The protocol can be implemented efficiently for large graph sates of arbitrary (complex) topology. We benchmark our scheme with two protocols where each connected component is prepared in a node belonging to the component and subsequently distributed via quantum repeaters to the remaining connected nodes. We show that the fidelity of the generated graphs can be written as the partition function of a classical Ising-type Hamiltonian. We give exact expressions of the fidelity of the linear cluster and results for its decay rate in random graphs with arbitrary (uncorrelated) degree distributions.Comment: 16 pages, 7 figure